Approximate symbolic pattern matching for protein sequence data

نویسندگان

  • Bill C. H. Chang
  • Saman K. Halgamuge
چکیده

In protein sequences, often two sequences that share similar substrings have similar functional properties. Learning of the characteristics and properties of an unknown protein is much easier if its likely functional properties can be predicted by finding the substrings already known from other protein sequences. The sequence pattern search algorithm proposed in this paper searches for similar matches between a pattern and a sequence by using fuzzy logic and calculates the degree of similarity from a sequence inference step. Proteins from 11 domain families are used for simulation and the result shows that the proposed algorithm is capable of identifying sequences that have a similar pattern compared to their family protein motifs. 2002 Elsevier Science Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MusicBLAST - Gapped Sequence Alignment for MIR

We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used algorithms for similarity search on biological sequence data [1, 2]. MusicBLAST can be used in combination with an arbitrary similarity measure (e.g., melodic, rhythmic or combined) and retrieves multiple occurrences of ...

متن کامل

Face Recognition using Approximate String Matching

String matching algorithm is a very useful algorithm in pattern matching that can be used to match any patterns that can be represented in strings or sequence. This paper will discussed how string matching can be used as a method for face recognition. We will focus on the implementation using approximate string matching. In order for face images to be implemented in pattern matching, they have ...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

Symbolic Pattern Databases in Heuristic Search Planning

This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent action planning, namely heuristic search and model checking. SPDBs are off-line computed dictionaries, generated in symbolic backward traversals of automatically inferred planning space abstractions. The entries of SPDBs serve as heuristic estimates to accelerate exp...

متن کامل

Flexible Matching of Boolean Symbolic Objects

Matching is the process of comparing two or more structures to discover their likenesses or differences. It is a common operation performed in symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is important for the development of symbolic data analysis techniques. In this paper we give the definition o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2003